Case-Based Reasoning for Explaining Probabilistic Machine Learning

نویسندگان

  • Tomas Olsson
  • Daniel Gillblad
  • Peter Funk
  • Ning Xiong
چکیده

This paper describes a generic framework for explaining the prediction of probabilistic machine learning algorithms using cases. The framework consists of two components: a similarity metric between cases that is defined relative to a probability model and an novel case-based approach to justifying the probabilistic prediction by estimating the prediction error using case-based reasoning. As basis for deriving similarity metrics, we define similarity in terms of the principle of interchangeability that two cases are considered similar or identical if two probability distributions, derived from excluding either one or the other case in the case base, are identical. Lastly, we show the applicability of the proposed approach by deriving a metric for linear regression, and apply the proposed approach for explaining predictions of the energy performance of households.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

Qualitative Propagation and Scenario-based Explanation of Probabilistic Reasoning

Comprehensible explanations of probabilistic reasoning are a prerequisite for wider acceptance of Bayesian methods in expert systems and decision support systems. A study of human reasoning under uncertainty suggests two different strategies for explaining probabilistic reasoning: The first, qualitative belief propagation, traces the qualitative effect of evidence through a belief network from ...

متن کامل

Knowledge-Based Techniques for Software Requirements Validation

This document explains a knowledge based model intended to help in Software Requirements Validation. We rst construct automatically a speci cation model from a set of correct speci cations using machine learning techniques; and then this model is used to validate new speci cations. The machine learning techniques that are used, combine ideas from terminological reasoning, analogical reasoning a...

متن کامل

Explaining Probabilistic Fault Diagnosis and Classification Using Case-Based Reasoning

This paper describes a generic framework for explaining the prediction of a probabilistic classifier using preceding cases. Within the framework, we derive similarity metrics that relate the similarity between two cases to a probability model and propose a novel case-based approach to justifying a classification using the local accuracy of the most similar cases as a confidence measure. As basi...

متن کامل

Explaining Effective Learning by Analogical Reasoning

Machine learning algorithms are usually considered as explicit learning strategies requiring large data samples. Contrary to these accounts, cognitive learning seems to be based on significantly less amounts of training data and occurs often in the form of implicit learning. In order to close this gap we propose to explain these discrepancies by a form of analogical learning, bridging these two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014